Strengthened splitting methods for computing resolvents

نویسندگان

چکیده

In this work, we develop a systematic framework for computing the resolvent of sum two or more monotone operators which only activates each operator in individually. The key tool development is notion “strengthening” set-valued operator, can be viewed as type regularisation that preserves computational tractability. After deriving number iterative schemes through framework, demonstrate their application to best approximation problems, image denoising and elliptic PDEs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Galois Ideals for Computing Relative Resolvents

Let k be a perfect field and k̄ an algebraic closure of k. Let f be a separable univariate polynomial of k[X] with degree n, and Ω be an ordered set of the n distinct roots of f in k̄. In Valibouze (1999) the notion of ideal of Ω-relations invariant by a subset L of the symmetric group of degree n is introduced. It generalizes the notion of ideal of relations and the notion of ideal of symmetric ...

متن کامل

Computing Exponential for Iterative Splitting Methods: Algorithms and Applications

Iterative splitting methods have a huge amount to compute matrix exponential. Here, the acceleration and recovering of higher-order schemes can be achieved. From a theoretical point of view, iterative splitting methods are at least alternating Picards fix-point iteration schemes. For practical applications, it is important to compute very fast matrix exponentials. In this paper, we concentrate ...

متن کامل

islanding detection methods for microgrids

امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...

15 صفحه اول

Complexity Issues in Computing Spectra, Pseudospectra and Resolvents

We display methods that allow for computations of spectra, pseudospectra and resolvents of linear operators on Hilbert spaces and also elements in unital Banach algebras. The paper considers two different approaches, namely, pseudospectral techniques and polynomial numerical hull theory. The former is used for Hilbert space operators whereas the latter can handle the general case of elements in...

متن کامل

Kummer, Eisenstein, Computing Gauss Sums as Lagrange Resolvents

In fact, [Eisenstein 1850] evaluated cubes and fourth powers of Gauss sums attached to cubic and quartic characters to prove the corresponding reciprocity laws. One essential point is the p-adic approximation of Gauss sums by [Kummer 1847], generalized in [Stickelberger 1890]. Since the rings of algebraic integers generated by third or fourth roots of unity have class number one and finitely-ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2021

ISSN: ['0926-6003', '1573-2894']

DOI: https://doi.org/10.1007/s10589-021-00291-6